package com.gxc.tree;

/**
 * Created by ASD on 2023/6/26.
 */
public class TrieNode {
    //经过的次数
    public int pass;
    //是否是结束节点
    public int end;
    public TrieNode[] next;

    public TrieNode() {
        this.pass = 0;
        this.end = 0;
        // nexts[0] == null没有走向“a’的路
        // nexts[0] ! null有走向“a’的路
        // ...
        // nexts[25] != nul 有走向“z’的路
        this.next = new TrieNode[26];
    }
}
